Communication complexity and combinatorial lattice theory
نویسندگان
چکیده
منابع مشابه
A convex combinatorial property of compact sets in the plane and its roots in lattice theory
K. Adaricheva and M. Bolat have recently proved that if $,mathcal U_0$ and $,mathcal U_1$ are circles in a triangle with vertices $A_0,A_1,A_2$, then there exist $jin {0,1,2}$ and $kin{0,1}$ such that $,mathcal U_{1-k}$ is included in the convex hull of $,mathcal U_kcup({A_0,A_1, A_2}setminus{A_j})$. One could say disks instead of circles.Here we prove the existence of such a $j$ and $k$ ...
متن کاملChaos/Complexity Theory and Education
Sciences exist to demonstrate the fundamental order underlying nature. Chaos/complexity theory is a novel and amazing field of scientific inquiry. Notions of our everyday experiences are somehow in connection to the laws of nature through chaos/complexity theory’s concerns with the relationships between simplicity and complexity, between orderliness and randomness (Retrieved from http://www.inc...
متن کاملPublications in Communication Complexity Theory
This pair of papers contains lower bounds in the “number-on-forehead” (NOF) model of multi-party communication complexity that remain the strongest even to date, after 24 years, in spite of considerable effort. The paper includes applications to a variety of models of computation: time-space tradeoff for multi-head Turing machines, lower bounds for branching programs, pseudorandom generators fo...
متن کاملCommunication and culture: A complexity theory approach
In the target paper, Kashima (2014) harvests insights from communication research, shared reality theory in social psychology, diffusionism in cognitive anthropology and connectionism in cognitive psychology to propose a neodiffusionist account of culture. A major contribution of this account is that it offers a social psychological explanation of the formation, maintenance, and transformation ...
متن کاملInformation theory and Communication Complexity - Lecture 2
3 The randomized communication complexity of Disjointness 8 3.1 High level idea of the proof reduction to internal information of AND . . . 8 3.2 The Internal Information of AND . . . . . . . . . . . . . . . . . . . . . . . . 8 3.2.1 Divergence and Statistical Distance . . . . . . . . . . . . . . . . . . . 8 3.2.2 High level idea of the proof . . . . . . . . . . . . . . . . . . . . . . . 10 3.2...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1993
ISSN: 0022-0000
DOI: 10.1016/0022-0000(93)90035-u